A Comparative Representation Approach To Modern Heuristic Search Methods In A Job Shop
نویسندگان
چکیده
The job shop problem is among the class of NPhard combinatorial problems. This Research paper addresses the problem of static job shop scheduling on the job-based representation and the rule based representations. The popular search techniques like the genetic algorithm and simulated annealing are used for the determination of the objectives like minimizations of the makespan time and mean flow time. Various rules like the SPT, LPT, MWKR, and LWKR are used for the objective function to attain the results. The summary of results from this paper gives a conclusion that the genetic algorithm gives better results in the makespan time determination on both the job based representation and the rule based representation and the simulated annealing algorithm gives the better results in the mean flow time in both the representations.
منابع مشابه
An Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations
Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...
متن کاملA New model for integrated lot sizing and scheduling in flexible job shop problem
In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and S...
متن کاملA multi Agent System Based on Modified Shifting Bottleneck and Search Techniques for Job Shop Scheduling Problems
This paper presents a multi agent system for the job shop scheduling problems. The proposed system consists of initial scheduling agent, search agents, and schedule management agent. In initial scheduling agent, a modified Shifting Bottleneck is proposed. That is, an effective heuristic approach and can generate a good solution in a low computational effort. In search agents, a hybrid search ap...
متن کاملAn integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method
In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...
متن کاملSolving Flexible Job Shop Scheduling with Multi Objective Approach
In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...
متن کامل